Ensuring termination by typability
نویسندگان
چکیده
منابع مشابه
Ensuring Termination by Typability
A term terminates if all its reduction sequences are of finite length. Weshow four type systems that ensure termination of well-typed π-calculus processes.The systems are obtained by successive refinements of the types of the simply typedπ-calculus. For all (but one of) the type systems we also present upper bounds to thenumber of steps well-typed processes take to terminate. Th...
متن کاملEnsuring Termination in ESFP
In previous papers we have proposed an elementary discipline of strong functional programming (ESFP), in which all computations terminate. A key feature of the discipline is that we introduce a type distinction between data which is known to be nite, and codata which is (potentially) in nite. To ensure termination, recursion over data must be well-founded, and corecursion (the de nition schema ...
متن کاملEnsuring Consistent Termination of Composite Web Services
To reach a consistent termination state even in the presence of failures, composite web services require transactional support. Most current work on web services transactions is based on compensation. However, unlike in the traditional intra-organizational applications, the compensation is typically associated with temporal constraints in the context of web services. Such temporal constraints h...
متن کاملEnsuring the quasi-termination of needed narrowing computations
We present a characterization of first-order functional programs which are quasiterminating w.r.t. the symbolic execution mechanism of needed narrowing, i.e., computations in these programs consist of a sequence of finitely many different function calls (up to variable renaming). Quasi-terminating programs are particularly useful for program analysis and transformation, since in this context qu...
متن کاملEnsuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance
The control of polyvariance is a key issue in partial deduction of logic programs. Certainly, only nitely many specialised versions of any procedure should be generated, while, on the other hand, overly severe limitations should not be imposed. In this paper, well-founded orderings serve as a starting point for tackling this so-called \global termination" problem. Polyvariance is determined by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2006
ISSN: 0890-5401
DOI: 10.1016/j.ic.2006.03.002